Handelman’s hierarchy for the maximum stable set problem
نویسندگان
چکیده
منابع مشابه
Handelman's hierarchy for the maximum stable set problem
The maximum stable set problem is a well-known NP-hard problem in combinatorial optimization, which can be formulated as the maximization of a quadratic square-free polynomial over the (Boolean) hypercube. We investigate a hierarchy of linear programming relaxations for this problem, based on a result of Handelman showing that a positive polynomial over a polytope can be represented as conic co...
متن کاملAn exact algorithm for the maximum stable set problem
We describe a new branch-and-bound algorithm for the exact solution of the maximum cardinality stable set problem. The bounding phase is based on a variation of the standard greedy algorithm for finding a colouring of a graph. Two different node-fixing heuristics are also described. Computational tests on random and structured graphs and very large graphs corresponding to 'real-life' problems s...
متن کاملA Lagrangian Relaxation for the Maximum Stable Set Problem
We propose a new integer programming formulation for the problem of finding a maximum stable set of a graph based on representatives of stable sets. In addition, we investigate exact solutions provided by a Lagrangian decomposition of this formulation in which only one constraint is relaxed. Some computational experiments were carried out with an effective multi-threaded implementation of our a...
متن کاملAn Augmentation Algorithm for the Maximum Weighted Stable Set Problem
Edge projection is a specialization of Lovv asz and Plummer's clique projection when restricted to edges. A concept of augmenting sequences of edge-projections is deened w.r.t. a stable set S. It is then proved the equivalence between the optimality of S and the existence of an augmenting sequence w.r.t. S. This result is then exploited to develop a new tabu-search heuristic for the MaximumStab...
متن کاملAverage Case Polyhedral Complexity of the Maximum Stable Set Problem
We study the minimum number of constraints needed to formulate random instances of the maximum stable set problem via LPs (more precisely, linear extended formulations), in two distinct models. In the uniform model, the constraints of the LP are not allowed to depend on the input graph, which should be encoded solely in the objective function. There we prove a 2Ω(n/ log n) lower bound with prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 2013
ISSN: 0925-5001,1573-2916
DOI: 10.1007/s10898-013-0123-5